The Abstraction and Reasoning Corpus (ARC) challenge [7] is a difficult few-shot benchmark for testing visual reasoning capabilities of machine learning models. The capabilities The Abstraction and Reasoning Corpus (ARC) evaluates of recent general-purpose LLM systems are, as of general reasoning capabilities that are difficult for both now, not good enough to solve ARC at human performance machine learning models and combinatorial search methods. in a reasonably limited amount of time [19, 20, 28]. Arguably We propose a neuro-symbolic approach that combines their pre-training seems to have not imbued them a transformer for proposal generation with combinatorial with enough of the necessary concepts required to solve search using a domain-specific language. The transformer ARC tasks reliably and without an excessive number of narrows the search space by proposing promising search directions, tries. It is unclear whether LLMs lack the correct level of which allows the combinatorial search to find the abstraction and the specific type of high-level visual reasoning actual solution in short time.

There is a vast literature on representation learning based on principles such as coding efficiency, statistical independence, causality, controllability, or symmetry. In this paper we propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components. Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model, before being decoded to predict a future input state. The flow model is decomposed into a number of rotational (divergence-free) vector fields and a number of potential flow (curl-free) fields. Our sparsity prior encourages only a small number of these fields to be active at any instant and infers the speed with which the probability flows along these fields. Training this model is completely unsupervised using a standard variational objective and results in a new form of disentangled representations where the input is not only represented by a combination of independent factors, but also by a combination of independent transformation primitives given by the learned flow fields. When viewing the transformations as symmetries one may interpret this as learning approximately equivariant representations. Empirically we demonstrate that this model achieves state of the art in terms of both data likelihood and unsupervised approximate equivariance errors on datasets composed of sequence transformations.